The browser takes this and converts it into a tree - like structure , as in figure 1 瀏覽器接受該頁面并將之轉換為樹形結構,如圖1所示。
Object as one big key - value hashtable that structures the keys in a tree - like structure 對象當作一個大的鍵值散列表(這個表把樹形結構中的鍵組織起來) 。
If you are designing a gui like this , you can easily translate menu commands into grammar rules , especially since menus already have a tree - like structure that makes sure there are no overlapping commands 如果您設計象這樣的gui ,則可以方便地將菜單命令轉化成文法規則,尤其是因為菜單已經具有了樹狀結構,這可以確保沒有重疊命令。
Motivated by this observation , this paper studies the problem of efficiently processing k nn k - ge 1 search on r - tree - like structures storing historical information about moving object trajectories . two algorithms are developed based on best - first traversal paradigm , called bfp k nn and bft k nn , which handle the k nn retrieval with respect to the static query point and the moving query trajectory , respectively . both algorithms minimize the number of node access , that is , they perform a single access only to those qualifying nodes that may contain the final result 例如,若已知動物的軌跡,則動物學家可能提出如下兩種查詢: i在時間區間ti , tj內找到離一個給定的靜態點譬如食物源實驗室等最近的k條動物軌跡ii在時間區間ti , tj內找到離一條預先指定的動物軌跡最近的k條動物軌跡。
This article , according to the common digital keyboard on the mobile communication equipment , make essential research for windows ce - embedded operation system in chinese character input technology and realize with digital keyboard . using tree - like structure that has the space complexity o ( n ) and the time complexity of o ( n ) when searching to store chinese information . chinese input method applying this kind of store technique in chinese table has the quality of high input speed and low memory space 本文就根據移動通信設備上常見的數字鍵盤,為windowsce嵌入式操作系統在漢字的數字鍵盤輸入技術及其實現方面作了必要的研究;并使用了一種在查找時空間復雜度為o ( n ) 、時間復雜度為o ( n )的樹形結構來存儲中文信息,使用這種存儲技術作為碼表內存存放方式的漢字輸入法具有輸入速度快、占用空間少的優點。